On Weighted Heights of Random Trees
نویسنده
چکیده
Consider the family tree T of a branching process starting from a single progenitor and conditioned to have v=v(T) edges (total progeny). To each e d g e ( e ) we associate a weight W(e). The weights are i.i.d, random variables and independent of T. The weighted height of a self-avoiding path in T starting at the root is the sum of the weights associated with the path. We are interested in the asymptotic distribution of the maximum weighted path height in the limit as v = n ~ o0. Depending on the tail of the weight distribution, we obtain the limit in three cases. In particular if y2p(W(e)> y ) ~ 0 , then the limit distribution depends strongly on the tree and, in fact, is the distribution of the maximum of a Brownian excursion. If the tail of the weight distribution is regularly varying with exponent 0 ~< ~ < 2, then the weight swamps the tree and the answer is the asymptotic distribution of the maximum edge weight in the tree. There is a borderline case, namely, P(W(e) > y) ~ cy 2 as y ~ oo, in which the limit distribution exists but involves both the tree and the weights in a more complicated way.
منابع مشابه
Shedding new light on random trees
We introduce a weighted model of random trees and analyze the asymptotic properties of their heights. Our framework encompasses most trees of logarithmic height that were introduced in the context of the analysis of algorithms or combinatorics. This allows us to state a sort of“master theorem”for the height of random trees, that covers binary search trees (Devroye, 1986), random recursive trees...
متن کاملStatistics of delta peaks in the spectral density of large random trees
We present an analysis of the spectral density of the adjacency matrix of large random trees. We show that there is an infinity of delta peaks at all real numbers which are eigenvalues of finite trees. By exact enumerations and Monte-Carlo simulations, we have numerical estimations of the heights of peaks. In the large tree limit, the sum of their heights is 0.19173 ± 0.00005. Moreover all asso...
متن کاملLimit theorems for depths and distances in weighted random b-ary recursive trees
Limit theorems are established for some functionals of the distances between two nodes in weighted random b-ary recursive trees. We consider the depth of the nth node and of a random node, the distance between two random nodes, the internal path length and the Wiener index. As application these limit results imply by an imbedding argument corresponding limit theorems for further classes of rand...
متن کاملThe height of increasing trees
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of nodes converge in distribution. The height of these trees is shown to be in probability asymptotic to c logn for some constant c. We apply our results to obtain a law of large numbers for the height of all polynomial varie...
متن کاملMeasuring tree height: a quantitative comparison of two common fieldmethods in amoist tropical forest
1. Tree height is a key variable for estimating tree biomass and investigating tree life history, but it is difficult to measure in forests with tall, dense canopies and wide crowns. The traditional method, which we refer to as the ‘tangent method’, involves measuring horizontal distance to the tree and angles from horizontal to the top and base of the tree, while standing at a distance of perh...
متن کامل